A Number Theoretic Approach to Cycles in LDPC Codes
نویسندگان
چکیده
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such is trying to avoid cycles short length in associated Tanner graph, i.e. obtaining a possibly large girth. In this paper, we provide framework obtain constructions codes. We relate criteria for existence certain some number-theoretic concepts, particular so-called Sidon sets. way examples Finally, extend our also irregular
منابع مشابه
LDPC codes from Singer cycles
The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block codes—characterised by admitting a sparse parity check matrix—with good correction capabilities. In the present paper the orbits of subspaces of a finite projectiv...
متن کاملUnavoidable Cycles in Polynomial-Based Time-Invariant LDPC Convolutional Codes
Low-Density Parity-Check convolutional codes (LDPCccs) are very interesting for practical error-correction coding in wireless transmission as they have excellent performance and at the same time they allow for variable block size with low complexity encoding and decoding. As for all LDPC codes that are decoded by the sub-optimal (but highly efficient) Sum Product Algorithm, the cycles in the co...
متن کاملDetermination of Minimal Matrices of Simple Cycles in Ldpc Codes
Simple cycles are the easiest cycles to reveal in Low-Density Parity Check (LDPC) codes. All minimum matrices of simple cycles with the same length will be equivalent after row or column permutations .In this paper,we analysis the structure of simple cycles and show all figures of minimal matrices of simple cycles. Firstly, we introduce a more general definition of cycle and investigate simple ...
متن کاملA Number - Theoretic Approach to Homotopy Exponents
Let p be a prime number. The homotopy p-exponent of a topological space X, denoted by expp(X), is defined to be the largest e ∈ N = {0, 1, 2, . . .} such that some homotopy group πi(X) has an element of order p . This concept has been studied by various topologists (cf. [3], [4], [12], [15], [16], and [5]). The most celebrated result about homotopy exponents (proved by Cohen, Moore, and Neisend...
متن کاملAlgebraic constructions of LDPC codes with no short cycles
An algebraic group ring method for constructing codes with no short cycles in the check matrix is derived. It is shown that the matrix of a group ring element has no short cycles if and only if the collection of group differences of this element has no repeats. When applied to elements in the group ring with small support this gives a general method for constructing and analysing low density pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2022
ISSN: ['2405-8963', '2405-8971']
DOI: https://doi.org/10.1016/j.ifacol.2022.11.030